Boolean protocol filtering

ABSTRACT

The present invention provides methods and apparatus for filtering a broadcast data stream that can support data flow, e.g. IPv6 packets. The present invention utilizes common filtering for packet segments that are common among IPv6 packets. Segments that are not common are separately filtered. A set of rules is applied to the filtered segments in order to determine whether corresponding packets should be subsequently processed. The present invention is applicable to numerous application including MPEG multicast services.

FIELD OF THE INVENTION

[0001] The present invention relates to data filtering. In particular, the invention relates to apparatus and methods for filtering data packets of data for multiple data connections.

BACKGROUND OF THE INVENTION

[0002] With the evolution of communication services, digital services are requiring greater transmission bandwidth. Moreover, more subscribers are subscribing to these services, thus exacerbating the bandwidth demands to an even greater degree. Consequently, services that are common to a group of users and are unidirectional in nature can be broadcasted to the group of users. This approach is commonly referred as multicast services. One example of such a service is digital video broadcast (DVB) in which video signals (such as television) are broadcasted over different transport media, including terrestrial facilities (DVB-T), satellite facilities (DVB-S), and cable facilities (DVB-C). A plurality of services are typically transmitted over a common data stream.

[0003] Digital data is typically transported from one location to another in packets having well-defined segments. FIG. 1, for example, illustrates a MultiProtocol Encapsulation (MPE) packet 100 using a DSM-CC section format (also referred as a DSM-CC Private section) that may be used to transport audio, video or other data. Packet 100 includes several distinct segments that are defined by a protocol. For example, the MAC address is formed from different segments of packet 100.

[0004] Components that are configured to filter packets read information found in the different segments within the packet. For example, a digital video broadcast (DVB) receiver may read the information found in table id segment section 102, MAC address 1 segment 104, MAC address 2 segment 106 and MAC address 5 segment 108. Conventional hardware based filters are configured to read contiguous segments of data. When the desired data is found in clusters and is not contiguous, resources are wasted when excessively large filters are utilized to filter the clusters of data. Cluster is a generic term and may include a contiguous segment or a set of contiguous data within a packet or a segment of a packet. With respect to packet 100, table id 102 and MAC address segment 5 108 are found in non-contiguous segments or clusters. When a single filter is utilized to filter bits 0-40, the desired clusters are filtered along with several bits of unneeded data. As a result, the size of the filter is unnecessarily large. Supporting a plurality of data connections exacerbates the size of the filter configuration.

[0005] In order to provide DVB services, the associated MPEG-2 (Motion Picture Expert Group) transport stream (TS) that is received over the DVB RF channel contains a data signal having a large bandwidth, thus requiring substantial processing whether by associated hardware or by software being executed by a processor. The MPEG-2 stream broadcasts different services to different groups of users by multiplexing streams of different programs. In the art, the broadcasting arrangement is commonly referred as multicasting. There are many fields (segments) in the MPEG-2, MPE (Multiprotocol Encapsulation) and IP protocol headers that must be processed by the receiver's protocol filter. FIG. 2 shows processing a DVB transport stream according to prior art. A MPEG transport stream 225 carries DVB services and comprises a plurality of packets of different packet types as differentiated by a packet identifier (PID). A PID filter 201 compares each packet with a preselected PID and passes only packets containing the preselected PID in a transport stream 227. Consequently, a processor 205 processes all packets having the preselected PID. If processor 205 processes the data stream with software, the associated processor clock must be sufficiently high. However, increasing the clock speed increases the power consumption of the processor that executes the software. Especially with mobile terminals, power consumption is an important engineering consideration in view of the size of the terminal's battery. Processing the data stream with hardware also has engineering issues. Processing the large number of fields with a stream having a large bandwidth increases the required amount of logic circuitry. However, a circuit consumes more power as the size increases with circuit complexity.

[0006] New services such as DVB require high-bandwidth transport streams such MPEG-2 and MPEG-4. Consequently, the demands on a receiver in processing the transport streams are increasing. A method and apparatus that reduces the associated processing are beneficial in advancing the art in support of these services.

BRIEF SUMMARY OF THE INVENTION

[0007] An aspect of the present invention provides methods and apparatus for filtering a broadcast data stream that can support a plurality of data connections. The aspect of the present invention utilizes common filtering for packet segments that are common among the plurality of data connections. Segments that are not common are separately filtered. A set of logic rules is applied to the filtered segments in order to determine whether corresponding packets should be subsequently processed.

[0008] In an exemplary embodiment of the invention, a digital video broadcast (DVB) receiver that detects a plurality of IPv4 connections in accordance with a set of predetermined conditions that are applied to selected packet segments of a MPEG-2 (Motion Picture Expert Group) transport stream is provided. (However, the present invention can support protocols other than IPv4.) All selected packets are inputted to a processor for subsequent processing. The selection of the packets is performed by a programmable filter arrangement that utilizes common filtering and Boolean logic. A variation of the exemplary embodiment detects a plurality of IPv6 connections.

[0009] Another exemplary embodiment comprises a programmable filter arrangement in which Boolean logic functionality is applied to service information table connections. A service information packet is passed for subsequent processing only if the service information packet has been updated since the last occurrence of processing the packet by a processor.

BRIEF DESCRIPTION OF THE DRAWINGS

[0010] A more complete understanding of the present invention and the advantages thereof may be acquired by referring to the following description in consideration of the accompanying drawings, in which like reference numbers indicate like features and wherein:

[0011]FIG. 1 shows a conventional digital video broadcast (DVB) MultiProtocol Encapsulation (MPE) packet using a DSM-CC section format (also referenced as a DSM-CC Private section);

[0012]FIG. 2 shows processing a DVB transport stream according to prior art;

[0013]FIG. 3 shows a receiver in accordance with an embodiment of the present invention;

[0014]FIG. 4 shows an architectural configuration for a programmable filter arrangement in which Boolean logic functionality combines MPE data connections in accordance with an embodiment of the present invention;

[0015]FIG. 5 shows an architectural configuration for a programmable filter arrangement in which Boolean logic functionality combines IPv6 data connections in accordance with an embodiment of the present invention;

[0016]FIG. 6 shows an architectural configuration for a programmable filter arrangement in which Boolean logic functionality combines service information table connections in accordance with an embodiment of the present invention;

[0017]FIG. 7 illustrates a system for filtering clusters of data found in packets, in accordance with an embodiment of the invention; and

[0018]FIG. 8 shows a flow diagram in accordance with an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[0019] In the following description of the various embodiments, reference is made to the accompanying drawings which form a part hereof, and in which is shown by way of illustration various embodiments in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural and functional modifications may be made without departing from the scope of the present invention.

[0020]FIG. 3 shows a digital video broadcast (DVB) receiver 300 in accordance with an embodiment of the present invention. In the exemplary embodiment, receiver 300 comprises a receiver front-end 301, a programmable filter 303, a user interface 307, and a processor 305. Receiver front-end 301 receives a signal 325 that may contain a MPEG transport stream. Receiver front-end 301 may be configured to extract the MPEG transport stream and transmit a MPEG transport stream 327 to a programmable filter arrangement 303. The present invention supports services, including broadcast services (i.e. one to all), multicast services (i.e. one to many, and unicast services (i.e. one to one). MPEG transport stream 327 may contain packets that correspond to different services and that are distinguished by a predetermined combination of segments (fields). Receiver front-end 301 converts signal 325 into a baseband format, such that MPEG transport stream 327 can be filtered by programmable filter 303 in order to determine whether the predetermined combination of segments in transport stream 327 is indicative of a desired service within transport stream 327. As an example, transport stream 327 can contain a plurality of video programs (e.g. business news on CNN and mystery movies on HBO). Programmable filter arrangement 303 determines if each relevant segment is equal to a predetermined value. If so, a Boolean value corresponding to the filtered segment is “true” or “1.” If not, the Boolean value is “false” or “0.” Boolean logic is consequently applied to the corresponding Boolean values in order to process the desired program in transport stream 327. However, variations of the exemplary embodiment can utilize alternative approaches to logic such as a set of logic rules or predicate calculus.

[0021] Selected packets may be inputted to a processor 305 for further processing through a port 329. Processor 305 configures programmable filter arrangement 303 through a port 331 in order that filter arrangement 303 filters the relevant segments of the TS packets in accordance with the selected service. Operation of programmable filter arrangement 303 is discussed in more detail in conjunction with FIGS. 4, 5, 6, and 7.

[0022] A user interface 307 interfaces to processor 305 through a bi-directional port 333. User interface 307 enables the user of receiver 300 to configure receiver 300 to select services from a plurality of services carried by signal 325. User interface 307 may include a display 308 that can be utilized to display a subset of available services for the user as illustrated as an entry 309 and an entry 311. The entries may appear to the user in alphanumeric format to facilitate viewing. The user subsequently manipulates a cursor 313 in order to select entry 311. The service selection is inputted to processor 305 through port 333. Processor 305 processes the corresponding alphanumeric information in order to determine the corresponding filter values. The filter values are subsequently outputted to programmable filter arrangement 303 through port 331. An indicator 312 is activated when programmable filter arrangement 303 has been configured to filter the selected service in order to notify the user of the service configuration.

[0023]FIG. 4 shows an architectural configuration for programmable filter arrangement 303 in which Boolean logic functionality combines MPE data connections in accordance with an embodiment of the present invention. The programmable filter arrangement (corresponding to filter arrangement 303 in FIG. 3) comprises a packet identification (PID) filter 401, a Table_ID segment filter 403, a MAC1, MAC2 segments filter 405, a MAC3, MAC4 segments filter 407, and MAC5, MAC6 segments filters 409, 411, 413, and 415.

[0024] A MPEG transport stream 425 can multiplex a plurality of services. Each service corresponds to a plurality of TS packets that are distinguishable by different segment values. Each filter (e.g. filter 405) is configured to span MPEG transport stream 425 across a specified segment and to determine if the corresponding value is equal to a predetermined value. If so, the corresponding TS packet passes through filters 401, 403, 405, 407, 409, 411, 413, and 415 to be further processed by a subsequent processing element, which may be a cascaded filter or a processor. (An MPE packet can be transported in a plurality of TS packets. In that case, as supported by the present invention, MAC1, MAC2, MAC3, MAC4, MAC5, and MAC6 segments may not be transported in the same TS packet.)

[0025] In FIG. 4, MPEG transport stream 425 is processed by PID filter 401. Filter 401 passes a data stream 427 that contains only packets having a specified value. (The packet can be an MPE/DSM-CC section packet that is carrying IP inside its payload area or a pure IPv4/IPv6 packet.) Subsequent processing by filters 403, 405, and 407 determines if the input data stream (corresponding to data streams 429, 431, and 433 respectively) has corresponding segments with predetermined values. If so, the data stream is passed for further processing. In the exemplary embodiment, packets passed in a data stream 433 satisfy the Boolean relationship:

(PID==w) AND (Table_ID==x) AND (MAC 1,MAC2==y) AND (MAC3,MAC4==z)  (EQ. 1)

[0026] where w, x, y, and z are predetermined values. (“p==q” is a Boolean term that is “1” or “true” only if p is equal to q; otherwise the term is “0” or “false.”) Thus, the “AND” Boolean operation is correspondingly implicit among filters 403, 405, and 407.

[0027] Filters 409, 411, 413, and 415 separately filter data stream 433 according to MAC5 and MAC6 segments 108 and 110. The predetermined values that are utilized by each of filters 409, 411, 413, and 415 are different, thus distinguishing the corresponding value of the MAC5 and MAC6 segments. If an MPE packet contains MAC5 and MAC6 segments equal to predetermined values, filters 409, 411, 413, and 415 pass the packet through on data connections 435, 437, 439, and 441, respectively in order to be further processed by processor 305 through data port 329 as shown in FIG. 3. Data connections 435, 437, 439, and 441 collectively comprise data port 329. Each data connection may correspond to a separate physical input or may be multiplexed on the same physical input. If “R” represents the Boolean value of EQ. 1, then the corresponding Boolean function for the programmable filter arrangement shown in FIG. 4 is:

R AND ((MAC5,MAC6==a) OR (MAC5,MAC6===b) OR (MAC5,MAC6==c) OR (MAC5,MAC6==d))  EQ. 2

[0028]FIG. 5 shows an architectural configuration for programmable filter arrangement 303 in which Boolean logic functionality combines IPv6 (Internet protocol version 6) data flow in accordance with a variation of the exemplary embodiment of the present invention. IPv6 supports a larger address field (128 bits) with respect to IPv4 (32 bits). Consequently, processing IPv6 data flow may require substantially more processing resources. Common filtering of common segments can substantially reduce the increase of processing resources.

[0029] In the variation of the exemplary embodiment, programmable filter arrangement 303 comprises a PID filter 501, a Table_ID segment filter 503, a high address filter 505, and low address filters 509, 511, 513, and 515. A MPEG transport stream 525 is processed by PID filter 501. Filter 501 passes a data stream 527 that contains only packets having a specified value of the PID. Filter 503 passes packets having Table_ID segments that are equal to a predetermined value in a data stream 529. High address filter 505 passes packets having an IP address (127^(th) bit through 16^(th) bit and comprising address components 550, 551, 552, 553, 554, 555, and 556 and corresponding to 16 address bits) equal to a predetermined value through a data stream 533. Low address filters 509, 511, 513, and 515 process packets in data stream 533 in order to pass only packets having a low IP address (15^(th) bit through 0^(th) bit) with a predetermined value. The passed packets are sent to processor 305 for further processing on data connections 535, 537, 539, and 541. The corresponding Boolean function for the programmable filter arrangement in FIG. 5 is:

(PID==w) AND (Table_ID==x) AND (high address==y) AND ((low address==a) OR (low address==b) OR (low address==c) OR (low address==d))  (EQ. 3)

[0030] where w, x, y, a, b, c, and d are predetermined values.

[0031]FIG. 6 shows an architectural configuration for a programmable filter arrangement in which Boolean logic functionality combines service information table connections and another exemplary embodiment of the present invention. Programmable filter arrangement 303 comprises filters 601, 603, 605, 607, 609, 611, and 613 and passes service information packets to processor 305 for further processing. A MPEG transport stream 625 is processed by a PID filter 601. Filter 601 passes a data stream 627 that contains only packets having a specified PID value. Filters 603, 607, and 611 pass packets that are service information packets. (The packets may be MPE/DSMCC section packets that carry IP inside its payload area or may be pure IPv4/IPv6 packets if protocol headers are removed by the filter.) If the service information packet is updated since the last occurrence of processing the service information packet by processor 305, the packet is passed on data connections 627, 629, and 631 in order that processor 305 can further process the packet. The corresponding Boolean function of the programmable filter arrangement in FIG. 6 is:

(PID==w) AND (((Table_ID==x) AND NOT(latest version number==a)) OR ((Table_ID==y) AND NOT(latest version number==b)) OR ((Table_ID==z) AND NOT(latest version number==c)))  (EQ. 4)

[0032] Programmable filter arrangement 303 may utilize an architecture for cluster filtering as disclosed in a co-pending application entitled “Cluster Filtering” (Hakkarainen, et al.) and filed Dec. 20, 2001. FIG. 7 illustrates a system for filtering clusters of data found in packets, in accordance with an embodiment of the invention. As used herein, the term “packet” encompasses any digital data formatted in a protocol having discrete segments. Moreover, a packet may include data formatted in a first protocol that has been encapsulated or framed according to one or more additional protocols, for example Internet protocol (IP) packets encapsulated for transmission across a DVB network. A client system 702 (e.g. processor 305) transmits filter parameters to a cluster mapping module 704 that may be a component of programmable filter arrangement 303. Client system 702 maybe implemented with software and/or hardware components that include: a DVB receiver, user interface, mobile terminal, or any other hardware or software component that processes clusters of data found in digital packets. The filter parameters may include the identification of clusters of data located in segments of packets having a known protocol. For example, client system 702 may indicate that it desires to process table id 102 and MAC address sections 1-6 (shown in FIG. 1). In another example, client system 702 may indicate that it desires to filter a DVB-T interface for an IPv6 address. Cluster mapping module 704 may then create a cluster map from the filter parameters received from client system 702. The cluster map may then be transmitted to a cluster filter module 708 that may be another component of programmable filter arrangement 303.

[0033] The cluster map may include information such as a number of filters that will be utilized, the offset values of each of the filters, a filter mask and combinatory logic functions for each filter, i.e., which of the Boolean functions is used for a particular data segment when the return value (“TRUE” or “FALSE”) of the overall Boolean function over the active data segments is formed for data filtering. An offset value identifies a point, from the beginning of a packet, at which a given filter will begin filtering operations. A filtering services and protocol database 706 (that may be another component of programmable filter arrangement 303) may be included to store filtering and protocol information. (Other embodiments of the invention may directly connect client system 702 to cluster mapping module 704 in order to provide filter parameters without protocol database 706.) The formats of any number of protocols and the locations of sections of data within the protocols may be stored in database 706. Cluster maps may also be stored in database 706 to reduce the processing steps performed when a filter map has previously been created for a set of filter parameters. Instead of creating a new cluster map, the previously created cluster map may be retrieved from database 706.

[0034] Cluster filter module 708 includes six two-byte filters 708 a-708 f. In some embodiments of the invention, multiple identical filters are utilized because of the relative ease with which multiple identical filters maybe implemented in hardware. In alternative embodiments, the cluster filter module may include filters having a variety of different sizes and offset values. The sizes and offset values may be selected to correspond to predetermined applications and/or predetermined protocols by cluster mapping module 704. FIG. 7 shows that filter 708 a has an offset value of 0 bytes, that filter 708 b has an offset value of x bytes and that filter 708 c has an offset value of y bytes. The offset values are measured from the beginning of a packet. FIG. 7 shows an embodiment in which filters 708 a-708 f overlap. In other embodiments, filters 708 a-708 f may be formed so that some or none of filters 708 a-708 f overlap to conserve resources.

[0035] The following examples illustrate the benefits of utilizing clustering filtering and common filtering. As a first example, consider a programmable filter arrangement that supports 13 IPv4 connections through a DVB-T wireless network. Implementing a programmable filter arrangement with 13 separate parallel channels (one channel for each IPv4 connection), one requires 728 configuration registers (configuration bits) (13*(8+48)) to process Table_ID and MAC address segments for the 13 IPv4 connections. As a comparison, one can utilize common filtering configuration as shown in FIG. 4 and a cluster filtering configuration as shown in FIG. 7. However, in the example there are 13 MAC5, MAC6 segment filters rather than 4 segment registers as shown in FIG. 4. Using the approach as disclosed in the invention, one calculates that 640 configuration registers (configuration bits) (16*(16 bit filtering values+16-bit mask+8 bit for offset and Boolean filtering control) are needed for filtered values, corresponding to a semiconductor area savings of approximately 12%. Moreover, the true area savings is even greater because only one filtering channel logic circuit is needed rather than 13 separate logic circuits.

[0036] With a second example, consider processing 8 IPv6 connections, where each IPv6 address is 128 bits. With 8 separate IPv6 connections, one determines that 1,984 configuration registers (8* (8+7*16+8*16)) for processing Table_ID and IPv6 address information. However, using a similar configuration as shown in FIG. 5 (but with 8 low address filters rather than 4), one determines that 640 configuration registers are required for an area savings of approximately 67%. In general, with a greater component of common filtering values between received services and larger filtered segments, one obtains a greater the benefit with using common filtering and cluster filtering as disclosed in the present invention.

[0037]FIG. 8 shows a flow diagram in accordance with the exemplary embodiments of the present invention and is applicable with the programmable filter arrangements shown in FIGS. 4, 5, and 6. Step 801 determines if a plurality of data connections have common segments that have not been filtered. If so, step 803 is executed in order to determine if the i^(th) segment has a value equal to a predetermined value to obtain a corresponding Boolean value. Once all common segments have been processed, step 805 determines if segments that are not common among the data connections have been processed. Step 807 is executed in order to determine if the j^(th) segment has a value equal to a predetermined value to obtain a corresponding Boolean value. Step 809 executes the desired Boolean operations and passes the packet in step 811 if the resulting Boolean result is “true.”

[0038] As can be appreciated by one skilled in the art, a computer system with an associated computer-readable medium containing instructions for controlling the computer system can be utilized to implement the exemplary embodiments that are disclosed herein. The computer system may include at least one computer such as a microprocessor, digital signal processor, and associated peripheral electronic circuitry.

[0039] While the invention has been described with respect to specific examples including presently preferred modes of carrying out the invention, those skilled in the art will appreciate that there are numerous variations and permutations of the above described systems and techniques that fall within the spirit and scope of the invention as set forth in the appended claims. 

I/We claim:
 1. A method for processing a data stream by a filter arrangement for services, the method comprising the steps of: (a) receiving the data stream comprising a first service and a second service, the first service comprising a first packet and the second service comprising a second packet, the first packet comprising a first segment and a third segment, the second packet comprising a second segment; (b) determining a predetermined segment value; (c) selecting the first segment of the first packet and the second segment of the second packet; (d) comparing the predetermined segment value with the first segment in order to determine a first Boolean value; and (e) comparing the predetermined segment value with the second segment in order to determine a second Boolean value.
 2. The method of claim 1, wherein the first segment and the second segment have equal segment values.
 3. The method of claim 1, further comprising the steps of: (f) storing the first Boolean value and the second Boolean value; and (g) subsequently processing the first packet and the second packet.
 4. The method of claim 3, wherein step (g) comprises the steps of: (i) determining a second predetermined segment; (ii) selecting the third segment of the first packet; (iii) comparing the second predetermined segment value with the third segment in order to determine a third Boolean value; and (iv) combining the third Boolean value with the first Boolean value in accordance with a Boolean relationship in order to determine a final Boolean value.
 5. The method of claim 4, further comprising the step of: (v) passing the first packet if the final Boolean value equals “True”.
 6. The method of claim 1, further comprising the step of: (f) passing the first packet if the first Boolean value equals “True”, wherein a value of the first segment equals the predetermined segment value.
 7. The method of claim 1, further comprising the step of: (f) configuring the filter arrangement to process the first segment and the second segment.
 8. The method of claim 7, wherein step (f) comprises the steps of: (i) receiving an identification of at least two clusters, the at least two clusters comprising the first segment of the first packet and the second segment of the second packet; and (ii) selecting at least two of a plurality of fixed length filters to filter the at least two clusters.
 9. The method of claim 8, further comprising the step of: generating a filter mask that identifies segments of the at least two of a plurality of fixed length filters.
 10. The method of claim 9, further comprising the step of: providing filter values.
 11. The method of claim 10, further comprising the steps of: receiving a selection of the first service; and determining the filter values corresponding to the first service.
 12. The method of claim 1, wherein the first segment is selected from the group consisting of a Table_ID, an address identification, and a protocol identification.
 13. The method of claim 12, wherein the protocol identification corresponds to Internet Protocol over digital video broadcast (DVB-IP).
 14. The method of claim 12, wherein the address identification is selected from the group consisting from an IP version 4 address and an IP version 6 address.
 15. A method in a receiver for a user requesting one of a plurality of services, the method comprising the steps of: displaying a list of the plurality of services, wherein each service is transmitted over a broadcast channel; displaying a cursor, wherein the user selects the one of the plurality of services; and displaying an indicator when the receiver is configured to filter the selected service.
 16. A receiver that processes a data stream for services, the receiver comprising: a filter arrangement that compares a predetermined segment value with a first segment of a first packet and a second segment of a second packet, the first packet contained in the first service and the second packet contained in the second service; a processor that configures the filter arrangement, wherein the processor is configured to perform the steps of: (a) receiving the data stream; (b) determining a predetermined segment value; (c) selecting the first segment of the first packet and the second segment of the second packet; (d) comparing the predetermined segment value with the first segment in order to determine a first Boolean value; and (e) comparing the predetermined segment value with the second segment in order to determine a second Boolean value.
 17. The receiver of claim 16, wherein the processor is configured to perform the further steps of: (f) storing the first Boolean value and the second Boolean value; and (g) subsequently processing the first packet and the second packet.
 18. The receiver of claim 17, wherein step (g) comprises the steps of: (i) determining a second predetermined segment; (ii) selecting a third segment of the first packet; (iii) comparing the second predetermined segment value with the third segment in order to determine a third Boolean value; and (iv) combining the third Boolean value with the first Boolean value in accordance with a Boolean relationship in order to determine a final Boolean value.
 19. The receiver of claim 16, wherein the filter arrangement comprises: a mapping module that obtains an identification of at least two clusters and that selects at least two of a plurality of fixed length filters to filter the at least two cluster, wherein the at least two clusters comprising the at least one segment; and a filter module comprising the plurality of fixed length filters that filters the at least two clusters.
 20. The receiver of claim 16, wherein the filter arrangement comprises integrated circuits.
 21. A computer-readable medium containing instructions for controlling a computer device to process a data stream by a filter arrangement for services, by: (a) receiving the data stream comprising a first service and a second service, the first service comprising a first packet and the second service comprising a second packet, the first packet comprising a first segment and a third segment, the second packet comprising a second segment; (b) determining a predetermined segment value; (c) selecting the first segment of the first packet and the second segment of the second packet; (d) comparing the predetermined segment value with the first segment in order to determine a first Boolean value; and (e) comparing the predetermined segment value with the second segment in order to determine a second Boolean value.
 22. The computer-readable medium of claim 21, further containing instructions for controlling the computer device to process a data stream by a filter arrangement, by: (f) storing the first Boolean value and the second Boolean value; and (g) subsequently processing the first packet and the second packet.
 23. The computer-readable medium of claim 22, further containing instructions for performing step (g), by: (i) determining a second predetermined segment; (ii) selecting the third segment of the first packet; (iii) comparing the second predetermined segment value with the third segment in order to determine a third Boolean value; (iv) combining the third Boolean value with the first Boolean value in accordance with a Boolean relationship in order to determine a final Boolean value; and (v) passing the first packet if the final Boolean value equals “True”.
 24. The computer-readable medium of claim 21, further containing instructions for controlling the computer device to process a data stream by a filter arrangement, by: (f) passing the first packet if the first Boolean value equals “True”, wherein a value of the first segment equals the predetermined segment value.
 25. A method for processing a data stream by a filter arrangement for services, the method comprising the steps of: (a) receiving the data stream comprising a first service and a second service, the first service comprising a first packet and the second service comprising a second packet, the first packet comprising a first segment and a third segment, the second packet comprising a second segment; (b) determining a predetermined segment value; (c) selecting the first segment of the first packet and the second segment of the second packet; (d) comparing the predetermined segment value with the first segment in order to determine a first Boolean value; (e) comparing the predetermined segment value with the second segment in order to determine a second Boolean value; (f) storing the first Boolean value and the second Boolean value; (g) determining a second predetermined segment; (h) selecting the third segment of the first packet; (i) comparing the second predetermined segment value with the third segment in order to determine a third Boolean value; (j) combining the third Boolean value with the first Boolean value in accordance with a Boolean relationship in order to determine a final Boolean value; and (k) passing the first packet if the final Boolean value equals “True”. 